Improving simulated annealing through derandomization
نویسندگان
چکیده
منابع مشابه
Identifying algorithmic vulnerabilities through simulated annealing
Real–time software systems with tight performance requirements are abundant. These systems frequently use many different algorithms and if these algorithms were to experience worst case behavior, the system may not be able to meet its performance requirements. Unfortunately, the inputs which would cause worst case behavior are often unknown, making it very difficult to defend against them. In t...
متن کاملComposite Stock Cutting through Simulated Annealing†
This paper explores the use of Simulated Annealing as an optimization technique for the problem Composite Material Stock Cutting. The shapes are not constrained to be convex polygons or even regular shapes. However, due to the composite nature of the material, the orientation of the shapes on the stock is restricted. For placements of various shapes, we show how to determine a cost function, an...
متن کاملImproving the Efficiency of Simulated Annealing Optimization through Detection of Productive Search
The popularity of simulated annealing for engineering design applications has grown in recent years, increasing the need for new techniques that improve algorithm performance. Simulated annealing is a time-consuming, iteration-intensive algorithm. One area of algorithm enhancement with high potential impact is the development of methods for improving the algorithm by reducing the amount of wast...
متن کاملA Mushy State Simulated Annealing
It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules...
متن کاملImproving spatial and temporal discretisation by simulated annealing
Two applications of simulated annealing are shown to optimise discretisation. First, a random but highly uniform pattern is generated using simulated annealing, whereby the average distance between the samples is maximised. In the other example, simulated annealing increases the time resolution of the discrete wind signal using an interpolation procedure that produces subscale speeds with consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2016
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-016-0461-1